DYNAMIC BACKGROUND SUBTRACTION BASED ON LOCAL DEPENDENCY HISTOGRAM
نویسندگان
چکیده
منابع مشابه
Dynamic Background Subtraction Based on Local Dependency Histogram
Traditional background subtraction methods perform poorly when scenes contain dynamic backgrounds such as waving tree, spouting fountain, illumination changes, camera jitters, etc. In this paper, a novel and effective dynamic background subtraction method is presented with three contributions. First, we present a novel local dependency descriptor, called local dependency histogram (LDH), to eff...
متن کاملLocal Histogram of Figure/Ground Segmentations for Dynamic Background Subtraction
We propose a novel feature, local histogram of figure/ground segmentations, for robust and efficient background subtraction (BGS) in dynamic scenes (e.g., waving trees, ripples in water, illumination changes, camera jitters, etc.). We represent each pixel as a local histogram of figure/ground segmentations, which aims at combining several candidate solutions that are produced by simple BGS algo...
متن کاملBackground subtraction based on Local Shape
We present a novel approach to background subtraction that is based on the local shape of small image regions. In our approach, an image region centered on a pixel is modeled using the local self-similarity descriptor. We aim at obtaining a reliable change detection based on local shape change in an image when foreground objects are moving. The method first builds a background model and compare...
متن کاملRobust Real-Time Background Subtraction Based on Local Neighborhood Patterns
This paper describes an efficient background subtraction technique for detecting moving objects. The proposed approach is able to overcome difficulties like illumination changes and moving shadows. Our method introduces two discriminative features based on angular and modular patterns, which are formed by similarity measurement between two sets of RGB color vectors: one belonging to the backgro...
متن کاملDependency Parsing Based on Dynamic Local Optimization
This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29% labeled attachment score on the average in CoNLLX Sha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2009
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001409007569